Reasoning About Probabilistic Actions at Multiple Levels of Granularity
نویسنده
چکیده
Models of physical actions are abstractions of the physical world and can never represent reality precisely. There are two fundamental choices anyone modeling physical action must face: The choice of what granularity to represent actions at and the choice of how to represent the state description. These two choices are closely coupled and form a basic tradeoff. Finer grain actions require more detail in the state description in order to discern possible interactions between the actions. This extra detail can result in large and complex models that are hard to acquire and tedious to use. Coarser grain actions alleviate the need to discern interactions and thus enable a more abstract state description to be used just as effectively; however, by modeling only coarse grain actions, the models are less flexible and less general. To reap the benefits of coarse-grain actions without sacrificing the flexibility of fine-grain actions, we advocate the use of models at multiple levels of granularity. Few (if any) existing frameworks support action models at multiple levels of granularity in a coherent fashion. We demonstrate this fact for the case of standard probabilistic models, and then introduce an approach that can handle multiple granularities and use it to demonstrate the fundamental tradeoff between abstraction and granularity.
منابع مشابه
Spatial Associative Classification at Different Levels of Granularity: A Probabilistic Approach
In this paper we propose a novel spatial associative classifier method based on a multi-relational approach that takes spatial relations into account. Classification is driven by spatial association rules discovered at multiple granularity levels. Classification is probabilistic and is based on an extension of naïve Bayes classifiers to multi-relational data. The method is implemented in a Data...
متن کاملModeling a semantic PDP network as a probabilistic classifier
McClelland and Rogers [1, 2] and Kemp and Tenenbaum [3] present two seemingly different models of how people reason about the attributes that different entities have. McClelland and Rogers present a neural network which is trained to predict, given the name of an entity and a particular relation (such as “can” or “has”), an appropriate set of responses to that query. Kemp and Tenenbaum, on the ...
متن کاملA Refinement-Based Architecture for Knowledge Representation and Reasoning in Robotics
This paper describes an architecture that combines the complementary strengths of probabilistic graphical models and declarative programming to enable robots to represent and reason with logic-based and probabilistic descriptions of uncertainty and domain knowledge. An action language is extended to support non-boolean fluents and nondeterministic causal laws. This action language is used to de...
متن کاملAction Networks: A Framework for Reasoning about Actions and Change under Uncertainty
This work proposes action networks as a semantically well founded framework for reasoning about actions under uncertainty. Action networks extend probabilistic causal networks to allow the representation of actions as directly controlling specific events in the domain (i.e., setting the value of nodes in the network) subject to preconditions. They also introduce models of time and persistence, ...
متن کاملProbabilistic Reasoning about Actions in Nonmonotonic Causal Theories
We present the language PC+ for probabilistic reasoning about actions, which is a generaliza tion of the action language C + that allows to deal with probabilistic as well as nondeterministic ef fects of actions. We define a formal semantics of PC+ in terms of probabilistic transitions be tween sets of states. Using a concept of a history and its belief state, we then show how several im po...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002